#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

//扑克牌顺子
bool IsContinuous(vector<int> numbers)
{
    int len = numbers.size();
    if (len == 0)
    {
        return 0;
    }
    vector<int> record(15, 0);
    int mmin = 15, mmax = 0;
    for (int i = 0; i < len; ++i)
    {
        record[numbers[i]]++;
        if (numbers[i] > mmax)
        {
            mmax = numbers[i];
        }
        if (numbers[i] < mmin && numbers[i] != 0)
        {
            mmin = numbers[i];
        }
        if (record[numbers[i]] > 1 && numbers[i] != 0)
        {
            return false;
        }
    }
    if (mmax - mmin + 1 <= len)
    {
        return true;
    }
    else
    {
        return false;
    }
}

void test()
{
}

int main()
{
    test();
    return 0;
}